//Accepted
//http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=615
#include <vector>
#include <set>
#include <algorithm>
#include <string>
#include <cmath>
#include <queue>
#include <map>
#include <iostream>
#include <list>
#include <deque>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
#define MAX 8000
int nway[MAX+1], coin[5]={50,25,10,5,1};

int main (){
	//freopen("in.txt", "r", stdin);//freopen("out.txt", "w", stdout);
	int i, j, n, v=5, c;
	
	while(scanf("%d", &n)==1){
		memset(nway,0,sizeof(nway));
		nway[0]=1;
		for(i=0;i<v;++i){
			c=coin[i];
			for(j=c;j<=n;++j){
				nway[j]+=nway[j-c];
			}
		}
		printf("%d\n", nway[n]);
	}
	return 0;
}
